Finite-size scaling approach to dynamic storage allocation problem
نویسندگان
چکیده
منابع مشابه
Finite size scaling approach to dynamic storage allocation problem
It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of finite size scaling. The method is illustrated in the three simple cases of the first-fit, next-fit and best-fit algorithms, and the system works at full capacity. The analysis is done from two different points of view running speed and employed memory. In both cases, and for all algorithms, it is shown tha...
متن کاملA New Approach to Dynamic Finite-size Scaling
In this work we have considered the Taylor series expansion of the dynamic scaling relation of the magnetization with respect to small initial magnetization values in order to study the dynamic scaling behaviour of 2and 3-dimensional Ising models. We have used the literature values of the critical exponents and of the new dynamic exponent x0 to observe the dynamic finite-size scaling behaviour ...
متن کاملNumerical computation of finite size scaling functions: An alternative approach to finite size scaling.
Using single cluster flip Monte Carlo simulations we accurately determine new finite size scaling functions which are expressed only in terms the variable x = ξL/L, where ξL is the correlation length in a finite system of size L. Data for the d=2 and d=3 Ising models, taken at different temperatures and for different size lattices, show excellent data collapse over the entire range of scaling v...
متن کاملFinite Size Scaling
We study the Bose-Einstein condensation phase transition in a weakly interacting gas through a perturbative analysis of finite systems. In both the grand canonical and the canonical ensembles, perturbation theory suffers from infrared divergences and cannot directly determine the transition temperature in the thermodynamic limit. However, in conjunction with finite size scaling, perturbation th...
متن کاملApproximation Algorithms and Heuristics for the Dynamic Storage Allocation Problem
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is known as the dynamic storage allocation problem (DSA) and it is known to be NP-complete. We develop some simple, polynomial-time approximation algorithms with the best of them achieving a bound of 4 for a subclass of DSA instances. We report on an extensive experimental study on the FirstFit heur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2003
ISSN: 0378-4371
DOI: 10.1016/s0378-4371(03)00509-0